Re: [SQL] optimizing 2-table join w/millions of rows - Mailing list pgsql-sql

From Herouth Maoz
Subject Re: [SQL] optimizing 2-table join w/millions of rows
Date
Msg-id l03110701b27f3f164fd6@[147.233.159.109]
Whole thread Raw
In response to Re: [SQL] optimizing 2-table join w/millions of rows  (Tom Lane <tgl@sss.pgh.pa.us>)
List pgsql-sql
At 18:10 +0200 on 23/11/98, Tom Lane wrote:


> Here, indexes on the part number would be stressed.  You'd have to
> experiment to see which is faster on your data.  (As far as I know,
> the Postgres optimizer will always evaluate your AND clauses left to
> right, which means that the key to performance is to make the leftmost
> clause reject as large a fraction of candidate rows as possible.)

I thought the optimizer canonized the where clause into an ANDing of ORs,
and then sought the best solution. That is, that the order of the clauses
did not matter, because the optimizer would know that comparison to a
literal on an indexed column is better than comparison to a field.

Herouth

--
Herouth Maoz, Internet developer.
Open University of Israel - Telem project
http://telem.openu.ac.il/~herutma



pgsql-sql by date:

Previous
From: Tom Lane
Date:
Subject: Re: [SQL] optimizing 2-table join w/millions of rows
Next
From: Engard Ferenc
Date:
Subject: cursor and update + view